A Necessary Condition of the Divisibility of Trinomials xam + xbs + 1 by any Irreducible Polynomial of Degree r over GF ( 2 )
نویسنده
چکیده
In this paper we are interested in to the divisibility of trinomials of type x am + x bs + 1 over a finite field GF (2). We show that, for any irreducible polynomial T of degree r over GF (2) and for any non-zero integers a and b, if there exist integers m and s such that T divides x am + x bs + 1 then a and b are not divisible by (2 r − 1).
منابع مشابه
Divisibility of Trinomials by Irreducible Polynomials over F_2
Irreducible trinomials of given degree n over F2 do not always exist and in the cases that there is no irreducible trinomial of degree n it may be effective to use trinomials with an irreducible factor of degree n. In this paper we consider some conditions under which irreducible polynomials divide trinomials over F2. A condition for divisibility of selfreciprocal trinomials by irreducible poly...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملAlgorithms for Finding Almost Irreducible and Almost Primitive Trinomials
Consider polynomials over GF(2). We describe efficient algorithms for finding trinomials with large irreducible (and possibly primitive) factors, and give examples of trinomials having a primitive factor of degree r for all Mersenne exponents r = ±3 mod 8 in the range 5 < r < 10, although there is no irreducible trinomial of degree r. We also give trinomials with a primitive factor of degree r ...
متن کاملA fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
The standard algorithm for testing reducibility of a trinomial of prime degree r over GF(2) requires 2r + O(1) bits of memory. We describe a new algorithm which requires only 3r/2+O(1) bits of memory and significantly fewer memory references and bit-operations than the standard algorithm. If 2r − 1 is a Mersenne prime, then an irreducible trinomial of degree r is necessarily primitive. We give ...
متن کاملA Fast Algorithm for Testing Irreducibility of Trinomials
The standard algorithm for testing reducibility of a trinomial of prime degree r over GF(2) requires 2r+O(1) bits of memory and Θ(r) bit-operations. We describe an algorithm which requires only 3r/2 + O(1) bits of memory and significantly fewer bit-operations than the standard algorithm. Using the algorithm, we have found 18 new irreducible trinomials of degree r in the range 100151 ≤ r ≤ 70005...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008